Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
نویسنده
چکیده
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical transport processes on graphs, and calculate the spacetime transition probabilities between two vertices of the lattice. Then we analytically show that there are two power law decays ∼ t−3 and ∼ t−1.5 at the beginning of the transport for transition probability in the continuous-time quantum and classical random walk respectively. This results illustrate the decay of quantum mechanical transport processes is quicker than that of the ∗Corresponding author: E-mail addresses: [email protected]
منابع مشابه
Study of continuous-time quantum walks on quotient graphs via quantum probability theory
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of reductions, by using the idea of calculation of the probability amplitudes for continuous-time quantum walk in terms of the spectral distribution associated wit...
متن کاملContinuous-time quantum walks on star graphs
In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N -fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K2 graphs (Complete graph with two vertices) and the probability of observing wal...
متن کاملEfficient quantum walk on a quantum processor.
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to...
متن کاملQuantum central limit theorem for continuous-time quantum walks on odd graphs
The method of spectral distribution only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. The idea of calculation of the probability amplitudes for continuous-time quantum walk, in terms of the spectral distribution associated with the adjacency matrix of graphs was firs...
متن کاملA Continuous - Time Quantum Walk for Attributed Graphs Matching
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information Processing
دوره 9 شماره
صفحات -
تاریخ انتشار 2010